Linearisation of w-Proofs: ANew Method of Generalisation within Automated Deduction
نویسندگان
چکیده
Generalisation is a major 'open' problem in theorem-proving which must often be addressed when attempting automation of proofs involving mathematical induction. This paper proposes a new, uniform method of generalisation, involving the transformation of proofs, which encompasses many different types of generalisation and which may succeed when other methods fail.
منابع مشابه
Improving legibility of natural deduction proofs is not trivial
In formal proof checking environments such as Mizar it is not merely the validity of mathematical formulas that is evaluated in the process of adoption to the body of accepted formalizations, but also the readability of the proofs that witness validity. As in case of computer programs, such proof scripts may sometimes be more and sometimes be less readable. To better understand the notion of re...
متن کاملOn the Use of the Constructive Omega-Rule within Automated Deduction
The cut elimination theorem for predicate calculus states that every proof may be replaced by one which does not involve use of the cut rule. This theorem no longer holds when the system is extended with Peano's axioms to give a formalisation for arithmetic. The problem of generalisa-tion results, since arbitrary formulae can be cut in. This makes theorem-proving very diicult | one solution is ...
متن کاملAutomated Deduction in Arithmetic with the Omega Rule
An important technique for investigating derivability in formal systems of arithmetic has been to embed such systems into semiformal systems with the w-rule. This paper exploits this notion within the domain of automated theorem-proving and discusses the implementation of such a proof environment. This involves providing an appropriate representation for infinite proofs, and a means of verifyin...
متن کاملInformation from Deduction: Models and Proofs
This report documents the program and the outcomes of Dagstuhl Seminar 15381 “Information from Deduction: Models and Proofs”. The aim of the seminar was to bring together researchers working in deduction and applications that rely on models and proofs produced by deduction tools. Proofs and models serve two main purposes: (1) as an upcoming paradigm towards the next generation of automated dedu...
متن کاملProof Certification in Zenon Modulo: When Achilles Uses Deduction Modulo to Outrun the Tortoise with Shorter Steps∗
We present the certifying part of the Zenon Modulo automated theorem prover, which is an extension of the Zenon tableau-based first order automated theorem prover to deduction modulo. The theory of deduction modulo is an extension of predicate calculus, which allows us to rewrite terms as well as propositions, and which is well suited for proof search in axiomatic theories, as it turns axioms i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001